Semidefinite programming for discrete optimization and matrix completion problems

Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming

Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM). In this paper, we follow the successful approach in [20] and solve the EDMCP by generalizing the completion problem to allow for approximate completions. In particular, we introdu...

Kernel Matrix Completion by Semidefinite Programming

Variational density matrix optimization using semidefinite programming

programming Brecht Verstichel, ∗ Helen van Aggelen, Dimitri Van Neck, Paul W. Ayers, and Patrick Bultinck Center for Molecular Modeling, Ghent University, Technologiepark 903, 9052 Zwijnaarde, Belgium Department of Inorganic and Physical Chemistry, Ghent University, Krijgslaan 281 (S3), 9000 Gent, Belgium Department of Chemistry, McMaster University, Hamilton, Ontario, L8S 4M1, Canada Abstract ...

Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems

A semidefinite programming hierarchy for packing problems in discrete geometry

Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for the maximal size of an independent set is to use Lasserre’s semidefinite programming hierarchy. We generalize this approach to infinite graphs. For this we int...